0.00/0.00	% File    : /export/starexec/sandbox/benchmark/theBenchmark.p
0.00/0.00	% app-encoded or not : original
0.00/0.00	% Variant    : supatvars_int
0.00/0.00	% Ordering    : kbo
0.00/0.00	% Command    : 
0.00/0.00	#!/bin/sh
0.00/0.00	
0.00/0.00	./zipperposition.native ${1:+"$1"} \
0.00/0.00	  -i tptp \
0.00/0.00	  -o tptp \
0.00/0.00	  --timeout "$STAREXEC_WALLCLOCK_LIMIT" \
0.00/0.00	  --mem-limit "$STAREXEC_MAX_MEM" \
0.00/0.00	  --no-avatar \
0.00/0.00	  --ho \
0.00/0.00	  --force-ho \
0.00/0.00	  --no-ho-elim-pred-var \
0.00/0.00	  --ho-general-ext-pos \
0.00/0.00	  --no-ho-unif \
0.00/0.00	  --no-induction \
0.00/0.00	  --no-unif-pattern \
0.00/0.00	  --ord $2  \
0.00/0.00	  --simultaneous-sup false \
0.00/0.00	  --sup-at-vars \
0.00/0.00	  --ho-no-ext-pos \
0.00/0.00	  --ho-no-ext-neg \
0.00/0.00	  --ho-prim-enum none \
0.00/0.00	  --no-max-vars \
0.00/0.00	  --dont-select-ho-var-lits \
0.00/0.00	  --no-fool
0.00/0.19	% Computer   : n073.star.cs.uiowa.edu
0.00/0.19	% Model      : x86_64 x86_64
0.00/0.19	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.00/0.19	% Memory     : 32218.625MB
0.00/0.19	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.00/0.19	% CPULimit   : 300
0.00/0.19	% DateTime   : Fri Feb  2 18:26:53 CST 2018
0.00/0.21	% done 19 iterations in 0.016s
0.00/0.21	% SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
0.00/0.21	% SZS output start Refutation
0.00/0.21	tff('thm/sets/UNION_UNIV_1', conjecture,
0.00/0.21	  (![A:$tType,A0:(A > $o)]:
0.00/0.21	     ('const/sets/UNION'(A,A0,'const/sets/UNIV'(A)) = 'const/sets/UNIV'(A)))).
0.00/0.21	tff(zf_stmt_0, negated_conjecture,
0.00/0.21	  (~
0.00/0.21	    (![A:$tType,A0:(A > $o)]:
0.00/0.21	       ('const/sets/UNION'(A,A0,'const/sets/UNIV'(A)) = 'const/sets/UNIV'(A))))).
0.00/0.21	tff('0', plain,
0.00/0.21	    'const/sets/UNION'(sk_A, sk_A0, 'const/sets/UNIV'(sk_A))
0.00/0.21	     != 'const/sets/UNIV'(sk_A),
0.00/0.21	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff('thm/sets/IN_UNIV_', axiom,
0.00/0.21	  (![A:$tType,A0:A]: 'const/sets/IN'(A,A0,'const/sets/UNIV'(A)))).
0.00/0.21	tff('1', plain,
0.00/0.21	    ![X0 : $tType, X1 : X0]: 'const/sets/IN'(X0, X1, 'const/sets/UNIV'(X0)),
0.00/0.21	    inference('cnf', [status(esa)], [thm/sets/IN_UNIV_])).
0.00/0.21	tff('thm/sets/IN_UNION_', axiom,
0.00/0.21	  (![A:$tType,A0:(A > $o),A1:(A > $o),A2:A]:
0.00/0.21	     ('const/sets/IN'(A,A2,'const/sets/UNION'(A,A0,A1)) <=>
0.00/0.21	      ('const/sets/IN'(A,A2,A1) | 'const/sets/IN'(A,A2,A0))))).
0.00/0.21	tff('2', plain,
0.00/0.21	    ![X6 : $tType, X8 : X6 > $o, X9 : X6 > $o, X10 : X6]:
0.00/0.21	      ('const/sets/IN'(X6, X10, 'const/sets/UNION'(X6, X8, X9))
0.00/0.21	       | ~ 'const/sets/IN'(X6, X10, X9)),
0.00/0.21	    inference('cnf', [status(esa)], [thm/sets/IN_UNION_])).
0.00/0.21	tff('thm/sets/EXTENSION_', axiom,
0.00/0.21	  (![A:$tType,A0:(A > $o),A1:(A > $o)]:
0.00/0.21	     ((A0 = A1) <=>
0.00/0.21	      (![A2:A]: ('const/sets/IN'(A,A2,A0) <=> 'const/sets/IN'(A,A2,A1)))))).
0.00/0.21	tff('3', plain,
0.00/0.21	    ![X11 : $tType, X14 : X11 > $o, X16 : X11 > $o]:
0.00/0.21	      (X14 = X16
0.00/0.21	       | ~ 'const/sets/IN'(X11, sk_A2(X11, X16, X14), X16)
0.00/0.21	       | ~ 'const/sets/IN'(X11, sk_A2(X11, X16, X14), X14)),
0.00/0.21	    inference('cnf', [status(esa)], [thm/sets/EXTENSION_])).
0.00/0.21	tff('4', plain,
0.00/0.21	    ![X0 : $tType, X1 : X0 > $o]:
0.00/0.21	      (~ $true
0.00/0.21	       | ~ 'const/sets/IN'(X0, sk_A2(X0, 'const/sets/UNIV'(X0), X1), X1)
0.00/0.21	       | X1 = 'const/sets/UNIV'(X0)),
0.00/0.21	    inference('sup-', [status(thm)], ['1', '3'])).
0.00/0.21	tff('5', plain,
0.00/0.21	    ![X0 : $tType, X1 : X0 > $o]:
0.00/0.21	      (X1 = 'const/sets/UNIV'(X0)
0.00/0.21	       | ~ 'const/sets/IN'(X0, sk_A2(X0, 'const/sets/UNIV'(X0), X1), X1)),
0.00/0.21	    inference('simplify', [status(thm)], ['4'])).
0.00/0.21	tff('6', plain,
0.00/0.21	    ![X0 : $tType, X1 : X0 > $o, X2 : X0 > $o]:
0.00/0.21	      (~ $true
0.00/0.21	       | ~ 'const/sets/IN'(X0, 
0.00/0.21	             sk_A2(X0, 'const/sets/UNIV'(X0), 'const/sets/UNION'(X0, X2, X1)), 
0.00/0.21	             X1)
0.00/0.21	       | 'const/sets/UNION'(X0, X2, X1) = 'const/sets/UNIV'(X0)),
0.00/0.21	    inference('sup-', [status(thm)], ['2', '5'])).
0.00/0.21	tff('7', plain,
0.00/0.21	    ![X0 : $tType, X1 : X0 > $o, X2 : X0 > $o]:
0.00/0.21	      ('const/sets/UNION'(X0, X2, X1) = 'const/sets/UNIV'(X0)
0.00/0.21	       | ~ 'const/sets/IN'(X0, 
0.00/0.21	             sk_A2(X0, 'const/sets/UNIV'(X0), 'const/sets/UNION'(X0, X2, X1)), 
0.00/0.21	             X1)),
0.00/0.21	    inference('simplify', [status(thm)], ['6'])).
0.00/0.21	tff('8', plain,
0.00/0.21	    ![X0 : $tType, X1 : X0 > $o]:
0.00/0.21	      (~ $true
0.00/0.21	       | 'const/sets/UNION'(X0, X1, 'const/sets/UNIV'(X0))
0.00/0.21	          = 'const/sets/UNIV'(X0)),
0.00/0.21	    inference('sup-', [status(thm)], ['1', '7'])).
0.00/0.21	tff('9', plain,
0.00/0.21	    ![X0 : $tType, X1 : X0 > $o]:
0.00/0.21	      'const/sets/UNION'(X0, X1, 'const/sets/UNIV'(X0))
0.00/0.21	       = 'const/sets/UNIV'(X0),
0.00/0.21	    inference('simplify', [status(thm)], ['8'])).
0.00/0.21	tff('10', plain, 'const/sets/UNIV'(sk_A) != 'const/sets/UNIV'(sk_A),
0.00/0.21	    inference('demod', [status(thm)], ['0', '9'])).
0.00/0.21	tff('11', plain, $false, inference('simplify', [status(thm)], ['10'])).
0.00/0.21	
0.00/0.21	% SZS output end Refutation
0.00/0.21	EOF
